BoltzCONS: Dynamic symbol structures in a connectionist network
نویسندگان
چکیده
منابع مشابه
BoltzCONS: Dynamic Symbol Structures in a Connectionist Network
BoltzCONS is a connectionist model that dynamically creates and manipulates composite symbol structures. These structures are implemented using a functional analog of linked lists, but BoltzCONS employs distributed representations and associative retrieval in place of a conventional memory organization. Associative retrieval leads to some interesting properties. For example, the model can insta...
متن کاملSymbol Structures in Connectionist Networks: Five Properties and Two Architectures
We define five properties of symbol representations (called the Five M's) that together provide a powerful and flexible symbol processing facility. Our ideal symbol structures arc Mobile, Memorable, Meaningful, Malleable, and Modifiable. Conventional symbol processing architectures, such as Lisp on von Neumann machines, support some of these properties, but others seem to require flexibility an...
متن کاملA Connectionist Network for Dynamic Programming Problems
Dynamic programmingis well-known as a powerful modeling techniquefor dealing with the issue of making optimal decisions sequentially. Many practical problems, such as nding shortest paths in route planning, multi-stage optimal control, can be formulated as special cases of the general sequential decision process. This paper proposes a connectionist network architecture, called the binary relati...
متن کاملRevenue - Profit Measurement in Data Envelopment Analysis with Dynamic Network Structures: A Relational Model
The correlated models are introduced in this article regarding revenue efficiency and profit efficiency in dynamic network production systems. The proposed models are not only applicable in measuring efficiency of divisional, periodical and overall efficiencies, but recognizing the exact sources of inefficiency with respect to revenue and profit efficiencies. Two numerical examples, consisting ...
متن کاملSymbol Processing Systems, Connectionist Networks, and Generalized Connectionist Networks
Many authors have suggested that SP (symbol processing) and CN (connectionist network) models offer radically, or even fundamentally, different paradigms for modeling intelligent behavior (see Schneider, 1987) and the design of intelligent systems. Others have argued that CN models have little to contribute to our efforts to understand intelligence (Fodor & Pylyshyn, 1988). A critical examinati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1990
ISSN: 0004-3702
DOI: 10.1016/0004-3702(90)90003-i